TSTP Solution File: NUM802^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM802^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:15:43 EDT 2024
% Result : Theorem 0.20s 0.37s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM802^5 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 14:04:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.35 This is a TH0_THM_EQU_NAR problem
% 0.20/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.zZ7HdzYVS3/Vampire---4.8_26027
% 0.20/0.37 % (26205)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.20/0.37 % (26199)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.20/0.37 % (26200)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.20/0.37 % (26205)First to succeed.
% 0.20/0.37 % (26201)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.20/0.37 % (26202)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.20/0.37 % (26204)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.20/0.37 % (26206)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.20/0.37 % (26203)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.20/0.37 % (26205)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for Vampire---4
% 0.20/0.37 % SZS output start Proof for Vampire---4
% 0.20/0.37 thf(func_def_1, type, absval: $i > $i).
% 0.20/0.37 thf(func_def_3, type, c_less_: $i > $i > $o).
% 0.20/0.37 thf(func_def_7, type, sK0: ($i > $o) > $i).
% 0.20/0.37 thf(func_def_10, type, ph2: !>[X0: $tType]:(X0)).
% 0.20/0.37 thf(f31,plain,(
% 0.20/0.37 $false),
% 0.20/0.37 inference(subsumption_resolution,[],[f30,f14])).
% 0.20/0.37 thf(f14,plain,(
% 0.20/0.37 ((c_less_ @ c_2 @ c0) = $true)),
% 0.20/0.37 inference(cnf_transformation,[],[f11])).
% 0.20/0.37 thf(f11,plain,(
% 0.20/0.37 ((c_less_ @ c_2 @ c0) = $true) & ! [X0 : $i > $o] : (((X0 @ c_2) != $true) | ((X0 @ (absval @ (sK0 @ X0))) = $true)) & ! [X2,X3] : (($true != (c_less_ @ X3 @ c0)) | ((absval @ X2) != X3))),
% 0.20/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10])).
% 0.20/0.37 thf(f10,plain,(
% 0.20/0.37 ! [X0 : $i > $o] : (? [X1] : ($true = (X0 @ (absval @ X1))) => ((X0 @ (absval @ (sK0 @ X0))) = $true))),
% 0.20/0.37 introduced(choice_axiom,[])).
% 0.20/0.37 thf(f9,plain,(
% 0.20/0.37 ((c_less_ @ c_2 @ c0) = $true) & ! [X0 : $i > $o] : (((X0 @ c_2) != $true) | ? [X1] : ($true = (X0 @ (absval @ X1)))) & ! [X2,X3] : (($true != (c_less_ @ X3 @ c0)) | ((absval @ X2) != X3))),
% 0.20/0.38 inference(rectify,[],[f8])).
% 0.20/0.38 thf(f8,plain,(
% 0.20/0.38 ((c_less_ @ c_2 @ c0) = $true) & ! [X2 : $i > $o] : (((X2 @ c_2) != $true) | ? [X3] : ((X2 @ (absval @ X3)) = $true)) & ! [X1,X0] : (((c_less_ @ X0 @ c0) != $true) | ((absval @ X1) != X0))),
% 0.20/0.38 inference(flattening,[],[f7])).
% 0.20/0.38 thf(f7,plain,(
% 0.20/0.38 (! [X2 : $i > $o] : (((X2 @ c_2) != $true) | ? [X3] : ((X2 @ (absval @ X3)) = $true)) & ! [X1,X0] : (((c_less_ @ X0 @ c0) != $true) | ((absval @ X1) != X0))) & ((c_less_ @ c_2 @ c0) = $true)),
% 0.20/0.38 inference(ennf_transformation,[],[f6])).
% 0.20/0.38 thf(f6,plain,(
% 0.20/0.38 ~(((c_less_ @ c_2 @ c0) = $true) => (! [X1,X0] : (((c_less_ @ X0 @ c0) = $true) => ((absval @ X1) != X0)) => ? [X2 : $i > $o] : (((X2 @ c_2) = $true) & ! [X3] : ((X2 @ (absval @ X3)) != $true))))),
% 0.20/0.38 inference(flattening,[],[f5])).
% 0.20/0.38 thf(f5,plain,(
% 0.20/0.38 ~(((c_less_ @ c_2 @ c0) = $true) => (! [X1,X0] : (((c_less_ @ X0 @ c0) = $true) => ((absval @ X1) != X0)) => ? [X2 : $i > $o] : (((X2 @ c_2) = $true) & ! [X3] : ~((X2 @ (absval @ X3)) = $true))))),
% 0.20/0.38 inference(fool_elimination,[],[f4])).
% 0.20/0.38 thf(f4,plain,(
% 0.20/0.38 ~((c_less_ @ c_2 @ c0) => (! [X0,X1] : ((c_less_ @ X0 @ c0) => ((absval @ X1) != X0)) => ? [X2 : $i > $o] : ((X2 @ c_2) & ! [X3] : ~(X2 @ (absval @ X3)))))),
% 0.20/0.38 inference(rectify,[],[f2])).
% 0.20/0.38 thf(f2,negated_conjecture,(
% 0.20/0.38 ~((c_less_ @ c_2 @ c0) => (! [X0,X1] : ((c_less_ @ X0 @ c0) => ((absval @ X1) != X0)) => ? [X2 : $i > $o] : ((X2 @ c_2) & ! [X3] : ~(X2 @ (absval @ X3)))))),
% 0.20/0.38 inference(negated_conjecture,[],[f1])).
% 0.20/0.38 thf(f1,conjecture,(
% 0.20/0.38 (c_less_ @ c_2 @ c0) => (! [X0,X1] : ((c_less_ @ X0 @ c0) => ((absval @ X1) != X0)) => ? [X2 : $i > $o] : ((X2 @ c_2) & ! [X3] : ~(X2 @ (absval @ X3))))),
% 0.20/0.38 file('/export/starexec/sandbox2/tmp/tmp.zZ7HdzYVS3/Vampire---4.8_26027',cBLEDSOE_FENG_8)).
% 0.20/0.38 thf(f30,plain,(
% 0.20/0.38 ((c_less_ @ c_2 @ c0) != $true)),
% 0.20/0.38 inference(superposition,[],[f15,f16])).
% 0.20/0.38 thf(f16,plain,(
% 0.20/0.38 (c_2 = (absval @ (sK0 @ (= @ c_2))))),
% 0.20/0.38 inference(leibniz_equality_elimination,[],[f13])).
% 0.20/0.38 thf(f13,plain,(
% 0.20/0.38 ( ! [X0 : $i > $o] : (((X0 @ c_2) != $true) | ((X0 @ (absval @ (sK0 @ X0))) = $true)) )),
% 0.20/0.38 inference(cnf_transformation,[],[f11])).
% 0.20/0.38 thf(f15,plain,(
% 0.20/0.38 ( ! [X2 : $i] : (((c_less_ @ (absval @ X2) @ c0) != $true)) )),
% 0.20/0.38 inference(equality_resolution,[],[f12])).
% 0.20/0.38 thf(f12,plain,(
% 0.20/0.38 ( ! [X2 : $i,X3 : $i] : (($true != (c_less_ @ X3 @ c0)) | ((absval @ X2) != X3)) )),
% 0.20/0.38 inference(cnf_transformation,[],[f11])).
% 0.20/0.38 % SZS output end Proof for Vampire---4
% 0.20/0.38 % (26205)------------------------------
% 0.20/0.38 % (26205)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (26205)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (26205)Memory used [KB]: 5500
% 0.20/0.38 % (26205)Time elapsed: 0.004 s
% 0.20/0.38 % (26205)Instructions burned: 2 (million)
% 0.20/0.38 % (26205)------------------------------
% 0.20/0.38 % (26205)------------------------------
% 0.20/0.38 % (26197)Success in time 0.003 s
% 0.20/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------